Predicate logic with flexibly binding operators and natural language semantics
نویسندگان
چکیده
A new formalism for predicate logic is introduced, with a non-standard method of binding variables, which allows a compositional formalization of certain anaphoric constructions, including ‘donkey sentences’ and crosssentential anaphora. A proof system in natural deduction format is provided, and the formalism is compared with other accounts of this type of anaphora, in particular Dynamic Predicate Logic.
منابع مشابه
Knowledge Representation for Lexical Semantics: Is Standard First Order Logic Enough?
Many natural language understanding tasks require lexicons that can support extensive lexically-based inferencing. To represent lexical semantics, most existing natural language understanding systems utilize Standard First Order Logic (FOL), or a subset of it. We argue that using a representation richer than FOL would facilitate better lexically-based inferencing. Using examples drawn from actu...
متن کاملHAJNAL ANDRÉKA, ISTVÁN NÉMETI and JOHAN VAN BENTHEM MODAL LANGUAGES AND BOUNDED FRAGMENTS OF PREDICATE LOGIC 1. MODAL LOGIC AND CLASSICAL LOGIC
Modal Logic is traditionally concerned with the intensional operators “possibly” and “necessary”, whose intuitive correspondence with the standard quantifiers “there exists” and “for all” comes out clearly in the usual Kripke semantics. This observation underlies the well-known translation from propositional modal logic with operators ♦ and , possibly indexed, into the first-order language over...
متن کاملApplications of Summation and Product Operators in the Reenement Calculus
Product and summation operators for predicate transformers were introduced by Naumann 20] and by Martin 15] using category theoretic considerations. In this paper, we formalise these operators in the higher order logic approach to the reenement calculus of 6], look at various algebraic properties of these operators, and examine several of their applications. We look at how the product operator ...
متن کاملSequence semantics for dynamic predicate logic
In this paper a semantics for dynamic predicate logic is developed that uses sequence valued assignments This semantics is compared with the usual relational semantics for dynamic predicate logic it is shown that the most important intuitions of the usual se mantics are preserved Then it is shown that the re ned semantics re ects out intuitions about information growth Some other issues in dyna...
متن کاملThe Donkey and the Monoid. Dynamic Semantics with Control Elements
Dynamic Predicate Logic DPL is a variant of Predicate Logic intro duced by Groenendijk en Stokhof One rationale behind the indroduction of DPL is that it is closer to Natural Language than ordinary Predicate Logic in the way it treats scope In this paper I develop some variants of DPL that can more easily approximate Natural Language in some further aspects Speci cally I add exibility in the tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Logic, Language and Information
دوره 2 شماره
صفحات -
تاریخ انتشار 1993